Solving Yin-Yang Puzzles Using Exhaustive Search and Prune-and-Search Algorithms

We investigate some algorithmic and mathematical aspects of Yin-Yang/Shiromaru-Kuromaru puzzles. Specifically, we discuss two algorithms for solving arbitrary Yin-Yang puzzles, namely the exhaustive search approach prune-and-search technique. show that both have an identical asymptotic running time O(max{mn, 2^(mn−h)}) finding all solutions a instance with h hints size m x n. Nevertheless, our experiments practical technique outperforms conventional approach.